Relating State Transformation Semantics and Predicate Transformer Semantics for Parallel Programs
نویسنده
چکیده
A state transformation semantics and a predicate transformer semantics for programs built from atomic actions, sequential composition, nondeterministic choice, parallel composition, atomisation, and recursion are presented. Both semantic models are derived from some SOS-style labelled transition system. The state transformation semantics and the predicate transformer semantics are shown to be isomorphic extending results of Plotkin and Best.
منابع مشابه
A duality between LM-fuzzy possibility computations and their logical semantics
Let X be a dcpo and let L be a complete lattice. The family σL(X) of all Scott continuous mappings from X to L is a complete lattice under pointwise order, we call it the L-fuzzy Scott structure on X. Let E be a dcpo. A mapping g : σL(E) −> M is called an LM-fuzzy possibility valuation of E if it preserves arbitrary unions. Denote by πLM(E) the set of all LM-fuzzy possibility valuations of E. T...
متن کاملMetric Predicate Transformers : Towards aNotion of Re nement for
A compositional weakest precondition semantics is given for a parallel language with recursion using a new metric resumption domain. By extending the classical duality of predicate vs. state transformers, the weakest precondition semantics for the parallel language is shown to be isomorphic to the standard metric state transformer semantics. Moreover , a notion of reenement for predicate transf...
متن کاملMetric Predicate Transformers : Towards a Notion of Re nement for ConcurrencyMarcello
For two parallel languages with recursion a compositional weakest precondition semantics is given using two new metric resumption domains. The underlying domains are characterized by domain equations involving functors that deliveròbservable' and`safety' predicate transformers. Further a reenement relation is deened for this domains and illustrated by rules dealing with concurrent composition. ...
متن کاملOn the Semantics of Refinement Calculi
Refinement calculi for imperative programs provide an integrated framework for programs and specifications and allow one to develop programs from specifications in a systematic fashion. The semantics of these calculi has traditionally been defined in terms of predicate transformers and poses several challenges in defining a state transformer semantics in the denotational style. We define a nove...
متن کاملA Predicate Transformer Semantics for a Concurrent Language of Refinement
Circus is a combination of Z and CSP; its chief distinguishing feature is the inclusion of the ideas of the refinement calculus. Our main objective is the definition of refinement methods for concurrent programs. The original semantic model for Circus is Hoare and He’s unifying theories of programming. In this paper, we present an equivalent semantics based on predicate transformers. With this ...
متن کامل